Metric Similarity Joins Using MapReduce
نویسندگان
چکیده
منابع مشابه
Technical Report: MapReduce-based Similarity Joins
Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Similarity Join, which retrieves all data pairs whose distances are smaller than a predefined threshold ε. Even though multiple algorithms and implementation techniques have been proposed for Similarity Joins, very little...
متن کاملSIGMOD RWE Review ”Efficient Parallel Set-Similarity Joins Using MapReduce”
This document is a review report on the paper ”Efficient Parallel Set-Similarity Joins Using MapReduce” by R. Vernica, M. Carey, C. Li by Sigmod’s 2010 Repeatability and Workability Evaluation Committee. In this section the provided resources (code, data sets, setup information) and hardware setups of the authors and reviewers are discussed. Detailed information on all experiments that the revi...
متن کاملQuicker Similarity Joins in Metric Spaces
We consider the join operation in metric spaces. Given two sets A and B of objects drawn from some universe U, we want to compute the set A B = {(a, b) ∈ A × B | d(a, b) ≤ r} efficiently, where d : U×U → R is a metric distance function and r ∈ R is user supplied query radius. In particular we are interested in the case where we have no index available (nor we can afford to build it) for eithe...
متن کاملExploiting Database Similarity Joins for Metric Spaces
Similarity Joins are recognized among the most useful data processing and analysis operations and are extensively used in multiple application domains. They retrieve all data pairs whose distances are smaller than a predefined threshold ε. Multiple Similarity Join algorithms and implementation techniques have been proposed. They range from out-of-database approaches for only in-memory and exter...
متن کاملEfficient and Scalable Graph Similarity Joins in MapReduce
Along with the emergence of massive graph-modeled data, it is of great importance to investigate graph similarity joins due to their wide applications for multiple purposes, including data cleaning, and near duplicate detection. This paper considers graph similarity joins with edit distance constraints, which return pairs of graphs such that their edit distances are no larger than a given thres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2017
ISSN: 1041-4347
DOI: 10.1109/tkde.2016.2631599